Algorithms for recursive delegation
نویسندگان
چکیده
منابع مشابه
FRPA: A Framework for Recursive Parallel Algorithms
Recursion continues to play an important role in high-performance computing. However, parallelizing recursive algorithms while achieving high performance is nontrivial and can result in complex, hardto-maintain code. In particular, assigning processors to subproblems is complicated by recent observations that communication costs often dominate computation costs. Previous work [1]–[3] demonstrat...
متن کاملRecursive Algorithms for Distributed Forests of Octrees
The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening (AMR) has recently been demonstrated in the context of a number of large-scale PDE-based applications. Efficient reference software has been made freely available to the public both in the form of the standalone p4est library and more indirectly by the general-purpose finite element library deal.II, which has bee...
متن کاملRecursive Algorithms for the Matrix Padé Problem
Abstract. A matrix triangularization interpretation is given for the recursive algorithms computing the Padé approximants along a certain path in the Padé table, which makes it possible to unify all known algorithms in this field [5], [6]. For the normal Padé table, all these results carry over to the matrix Padé problem in a straightforward way. Additional features, resulting from the noncommu...
متن کاملA Representation Theorem for Primitive Recursive Algorithms
We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is pres...
متن کاملFaster Algorithms for Weighted Recursive State Machines
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI Communications
سال: 2019
ISSN: 1875-8452,0921-7126
DOI: 10.3233/aic-190616